Data stability in clustering: A closer look

Data Stability in Clustering: A Closer Look

We consider the model introduced by Bilu and Linial [12], who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain efficient algorithms for instances resilient to certain multiplicative perturbations, e.g. on the order of O( √ n) for max-cut clustering. Awasthi et al. [6] c...

A Closer Look at Attack Clustering

Worms cause correlated failure of many systems in a short span of time. Therefore, automated defensive approaches have been proposed to counter growth of worms. However, in addition to worms, many other kinds of cyber-attacks also exhibit significant correlation, albeit with slightly different properties. We argue that those specific correlation properties manifest because of the interaction be...

Auctions : A Closer Look

A ClOser lOOk

In recent years, systems of care principles have been increasingly adopted because of their potential to support efforts to improve child welfare and other human service systems in ways that lead to increased safety, permanency, and well-being for children, adolescents, and their families. However, while the systems of care approach has become more widespread, a clear understanding of what defi...

A Sober Look at Clustering Stability

Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clusters. In spite of the popularity of stability in practical applications, there has been very little theoretical analysis of this notion. In this paper we provide a formal definition of stability and analyze some of its...